A maple program to generate orthonormal polynomials
نویسندگان
چکیده
منابع مشابه
A numerical study of electrohydrodynamic flow analysis in a circular cylindrical conduit using orthonormal Bernstein polynomials
In this work, the nonlinear boundary value problem in electrohydrodynamics flow of a fluid in an ion-drag configuration in a circular cylindrical conduit is studied numerically. An effective collocation method, which is based on orthonormal Bernstein polynomials is employed to simulate the solution of this model. Some properties of orthonormal Bernstein polynomials are introduced and utilized t...
متن کاملDagger: A Tool to Generate Program Graphs
Dagger is a tool that generates program graphs to selectively visualize a software structure. The design of dagger achieves a strong degree of language independence by exploiting the duality between a class of entity-relationship databases and attributed directed graphs. This paper describes the C and C++ versions of dagger, which map a selected subset of relationships stored in a program datab...
متن کاملUniformly bounded orthonormal polynomials on the sphere
Given any ε > 0, we construct an orthonormal system of nk uniformly bounded polynomials of degree at most k on the unit sphere in R where nk is bigger than 1− ε times the dimension of the space of polynomials of degree at most k. Similarly we construct an orthonormal system of sections of powers A of a positive holomorphic line bundle on a compact Kähler manifold with cardinality bigger than 1−...
متن کاملDeciding Nonnegativity of Polynomials by MAPLE
There have been some effective tools for solving (constant/parametric) semi-algebraic systems in Maple’s library RegularChains since Maple 13. By using the functions of the library, e.g., RealRootClassification, one can prove and discover polynomial inequalities. This paper is more or less a user guide on using RealRootClassification to prove the nonnegativity of polynomials. We show by example...
متن کاملWorking with Multivariate Polynomials in Maple
We comment on the implementation of various algorithms in multivariate polynomial theory. Specifically, we describe a modular computation of triangular sets and possible applications. Next we discuss an implementation of the F4 algorithm for computing Gröbner bases. We also give examples of how to use Gröbner bases for vanishing ideals in polynomial and rational function interpolation.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1991
ISSN: 0898-1221
DOI: 10.1016/0898-1221(91)90201-e